CS 186 Lecture 3 — P 2 P File - Sharing
نویسندگان
چکیده
For many applications that require the distribution of files to a very large number of users, peer-to-peer (P2P) file-sharing networks are an attractive alternative to server-based solutions. If the community of file-sharers cooperates appropriately, very high download rates can be achieved at virtually no cost to the injector of the content. We begin this chapter with a brief history of P2P file-sharing, including the rise and fall of Gnutella, and explain why so many file-sharing networks suffer from free riding. We then focus primarily on BitTorrent, the most successful filesharing network to date, with more than 100 Million users worldwide. We describe the BitTorrent protocol in detail, and present some game-theoretic analyses. Finally, we describe multiple attacks on BitTorrent that increase an individual user’s performance, and show how the BitTorrent protocol could be improved to increase overall social welfare.
منابع مشابه
Collisional depolarization of Zeeman coherences in the 133 Cs 6 p 2 P 3 / 2 level : Double - resonance two - photon polarization spectroscopy
An experimental investigation of the Cs 6s S1/2→6p P3/2→10s S1/2 double-resonance two-photon polarization spectrum has been made. In the investigation, a linear polarization degree was measured to extract the alignment depolarization cross section in the cesium 6p P3/2 level due to collisions between ground-level argon and excited 6p P3/2 cesium atoms over the Zeeman coherences. The spectra sho...
متن کاملEvaluating a P2P Database Server based on BitTorrent
Database systems have traditionally used a Client-Server architecture. As the server becomes overloaded, clients experience an increase in query response time, and in the worst case the server may be unable to provide any service at all. In file-sharing, the problem of server overloading has been addressed by the use of Peer-to-Peer (P2P) techniques in which users (peers) supply files to each o...
متن کاملCS 70 Discrete Mathematics for CS Spring 2007 Luca
Recall from your high school math that a polynomial in a single variable is of the form p(x) = adx + ad−1x + . . .+ a0. Here the variable x and the coefficients ai are usually real numbers. For example, p(x) = 5x3 +2x+1, is a polynomial of degree d = 3. Its coefficients are a3 = 5, a2 = 0, a1 = 2, and a0 = 1. Polynomials have some remarkably simple, elegant and powerful properties, which we wil...
متن کاملCS 229 r : Algorithms for Big Data Fall 2013 Lecture 4 — September 12 , 2013
2 Algorithm for Fp, p > 2 2 2.1 Alternate formulation of Chernoff bound . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Returning to proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Digression on Perfect Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Finishing proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملEvaluating a Peer-to-Peer Database Server Based on BitTorrent
Database systems have traditionally used a Client-Server architecture, with clients sending queries to a database server. If the server becomes overloaded, clients will experience an increase in query response time, and in the worst case the server may be unable to provide any service at all. In the domain of file-sharing, the problem of server overloading has been successfully addressed by the...
متن کامل